Density Functions for Visual Attributes and Effective Partitioning in Graph Visualization
نویسندگان
چکیده
Two tasks in Graph Visualization require partitioning: the assignment of visual attributes and divisive clustering. Often, we would like to assign a color or other visual attributes to a node or edge that indicates an associated value. In an application involving divisive clustering, we would like to partition the graph into subsets of graph elements based on metric values in such a way that all subsets are evenly populated. Assuming a uniform distribution of metric values during either partitioning or coloring can have undesired effects such as empty clusters or only one level of emphasis for the entire graph. Probability density functions derived from statistics about a metric can help systems succeed at these tasks. CR
منابع مشابه
Assessment of the Performance of Clustering Algorithms in the Extraction of Similar Trajectories
In recent years, the tremendous and increasing growth of spatial trajectory data and the necessity of processing and extraction of useful information and meaningful patterns have led to the fact that many researchers have been attracted to the field of spatio-temporal trajectory clustering. The process and analysis of these trajectories have resulted in the extraction of useful information whic...
متن کاملA Hierarchical Visual Clustering Method Using Implicit Surfaces
In this paper, we present a new hierarchical clustering and visualization algorithm called H-BLOB, which groups and visualizes cluster hierarchies at multiple levels-of-detail. Our method is fundamentally different to conventional clustering algorithms, such as C-means, K-means, or linkage methods that are primarily designed to partition a collection of objects into subsets sharing similar attr...
متن کاملDensity-Based Histogram Partitioning and Local Equalization for Contrast Enhancement of Images
Histogram Equalization technique is one of the basic methods in image contrast enhancement. Using this method, in the case of images with uniform gray levels (with narrow histogram), causes loss of image detail and the natural look of the image. To overcome this problem and to have a better image contrast enhancement, a new two-step method was proposed. In the first step, the image histogram is...
متن کاملGraph Hybrid Summarization
One solution to process and analysis of massive graphs is summarization. Generating a high quality summary is the main challenge of graph summarization. In the aims of generating a summary with a better quality for a given attributed graph, both structural and attribute similarities must be considered. There are two measures named density and entropy to evaluate the quality of structural and at...
متن کاملInteractive Visualization of Graph Pyramids
Graph or image pyramids can be used for hierarchical partitioning of images. One related application area is the automatical determination of landscapes in Landscape Ecology. The visualization of graph pyramids facilitates studies about their structure, such as their vertex distribution or height in relation of a specific input image. Thus, a researcher can debug algorithms and ask for statisti...
متن کامل